An Axiom System For the Weak Monadic Second Order Theory of Two Successors
نویسنده
چکیده
A complete axiom system for the weak monadic second order theory of two successor funct ions , W2S , is presen ted . The axiom system consists , rough ly , of the general ized Peano axioms and of an inductile defini t ion of the fini te sets . For the proof , methods of J . R . Buchi and J . Doner are used to obtain a new decision procedure for W2S , whose proofs are easi ly formal ized . Different fini teness axioms are d iscussed .
منابع مشابه
On the Logical Hierarchy of Graphs
Here is investigated the hierarchy of formulas deening graphs up to isomorphism in weak monadic second order logic. We give two proofs of the fact that this hierarchy is innnite, the rst is based on the Ehrenfeucht Fraiss e games and the second uses the arithmetical hierarchy. Finally we give a new proof of the Thomas theorem which states that the hierarchy of the weak monadic second order logi...
متن کاملLISA : A Speci cation Language Based on WS 2
We integrate two concepts from programming languages into a speciication language based on WS2S, namely high-level data structures such as records and recursively-deened datatypes (WS2S is the weak second-order monadic logic of two successors). Our integration is based on a new logic whose variables range over record-like trees and an algorithm for translating datatypes into tree automata. We h...
متن کاملLISA: A Specification Language Based on WS2S
We integrate two concepts from programming languages into a speciication language based on WS2S, namely high-level data structures such as records and recursively-deened datatypes (WS2S is the weak second-order monadic logic of two successors). Our integration is based on a new logic whose variables range over record-like trees and an algorithm for translating datatypes into tree automata. We h...
متن کاملWeak Cost Monadic Logic over Infinite Trees
Cost monadic logic has been introduced recently as a quantitative extension to monadic second-order logic. A sentence in the logic defines a function from a set of structures to N∪{∞}, modulo an equivalence relation which ignores exact values but preserves boundedness properties. The rich theory associated with these functions has already been studied over finite words and trees. We extend the ...
متن کاملOrdering Constraints over Feature Trees Expressed in Second-Order Monadic Logic
The system FT of ordering constraints over feature trees has been introduced as an extension of the system FT of equality constraints over feature trees. We investigate decidability and complexity questions for fragments of the first-order theory of FT . It is well-known that the first-order theory of FT is decidable and that several of its fragments can be decided in quasi-linear time, includi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013